منابع مشابه
Collective Intelligence and Braess' Paradox
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which at each moment each agent in the network sends all of its traffic down the path that will incur the lowest cost to that traffic. We demonstrate in computer experiments that due to the sideeffects of one agent’s actions...
متن کاملAvoiding Braess' Paradox through Collective Intelligence
In an Ideal Shortest Path Algorithm (ISPA), at each moment each router in a network sends all of its traffic down the path that will incur the lowest cost to that traffic. In the limit of an infinitesimally small amount of traffic for a particular router, its routing that traffic via an ISPA is optimal, as far as cost incurred by that traffic is concerned. We demonstrate though that in many cas...
متن کاملBraess Paradox in Dynamic Routing for the Cohen-kelly Network
A paradox of dynamic routing in the Cohen-Kelly network is studied. Intuitively, we expect that adding capacity to a network improves the performance of the users. Braess showed an example wherein the opposite occurs. We refer to such a situation as a paradox. In this paper, we deal with a class of queueing networks in which Cohen and Kelly discovered a paradox in static routing. We consider th...
متن کاملMatroids Are Immune to Braess' Paradox
The famous Braess paradox describes the following phenomenon: It might happen that the improvement of resources, like building a new street within a congested network, may in fact lead to larger costs for the players in an equilibrium. In this paper we consider general nonatomic congestion games and give a characterization of the maximal combinatorial property of strategy spaces for which Braes...
متن کاملCollective Intelligence, Data Routing and Braess' Paradox
We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system (MAS) so that they work synergistically to maximize a global utility. The particular problem domain we explore is the control of network routing by placing agents on all the routers in the network. Conventional approaches to this task have the agents all use the Ideal Shortest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2020
ISSN: 0024-3795
DOI: 10.1016/j.laa.2019.12.040